Centronit: Initial Centroid Designation Algorithm for K-Means Clustering
نویسندگان
چکیده
منابع مشابه
Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملAnalysis of Initial Centers for k-Means Clustering Algorithm
Data Analysis plays an important role for understanding different events. Cluster Analysis is widely used data mining technique for knowledge discovery. Clustering has wide applications in the field of Artificial Intelligence, Pattern Matching, Image Segmentation, Compression, etc. Clustering is the process of finding the group of objects such that objects in one group will be similar to one an...
متن کاملAn Optimized k-means Algorithm for Selecting Initial Clustering Centers
Selecting the initial clustering centers randomly will cause an instability final result, and make it easy to fall into local minimum. To improve the shortcoming of the existing kmeans clustering center selection algorithm, an optimized k-means algorithm for selecting initial clustering centers is proposed in this paper. When the number of the sample’s maximum density parameter value is not uni...
متن کاملRefining Initial Points for K-Means Clustering
Practical approaches to clustering use an iterative procedure (e.g. K-Means, EM) which converges to one of numerous local minima. It is known that these iterative techniques are especially sensitive to initial starting conditions. We present a procedure for computing a refined starting condition from a given initial one that is based on an efficient technique for estimating the modes of a distr...
متن کاملA new Initial Centroid finding Method based on Dissimilarity Tree for K-means Algorithm
—Cluster analysis is one of the primary data analysis technique in data mining and K-means is one of the commonly used partitioning clustering algorithm. In K-means algorithm, resulting set of clusters depend on the choice of initial centroids. If we can find initial centroids which are coherent with the arrangement of data, the better set of clusters can be obtained. This paper proposes a meth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EMITTER International Journal of Engineering Technology
سال: 2014
ISSN: 2443-1168,2355-391X
DOI: 10.24003/emitter.v2i1.17